package com.leetcode;

public class L0746 {
    public int minCostClimbingStairs(int[] cost) {
        int len=cost.length;
        if (len==2)
            return Math.min(cost[0],cost[1]);

        int[] dp=new int[len+1];
        dp[0]=0;
        dp[1]=0;

        for (int i=2;i<=len;i++){
            dp[i]=Math.min(dp[i-1]+cost[i],dp[i-2]+cost[i]);
        }
        return dp[len];
    }
}
